Space-Time Surface Simplification and Edgebreaker Compression for 2D Cel Animations

نویسندگان

  • Vivek Kwatra
  • Jarek Rossignac
چکیده

Digitized cel animations are typically composed of frames containing a small number of regions; each region contains pixels of the same color and exhibits a significant level of shape coherence through time. To exploit this coherence, we treat the stack of frames as a 3D volume and represent the evolution of each region by the bounding surface of the 3D sub-volume V that it sweeps out. To reduce transmission costs, we triangulate and simplify the bounding surface and then encode it using the Edgebreaker compression scheme. To restore a close approximation of the original animation, the client player decompresses the surface and produces the successive frames by intersecting V with constant-time planes. The intersection is generated in real-time with standard graphics hardware through an improved capping (i.e. solid clipping) technique, which correctly handles overlapping facets. We have tested this approach on real and synthetic black&white animations and report compression ratios that improve upon those produced using the MPEG, MRLE, and GZIP compression standards for an equivalent quality result.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surface Simplification and Edgebreaker Compression for 2D Cell Animations

Digitized cell animations are typically composed of frames, which contain a small number of regions, which each contain pixels of the same color and exhibit a significant level of shape coherence through time. To exploit this coherence, we treat the stack of frames as a 3D volume and represent the evolution of each region by the bounding surface of the 3D volume V that it sweeps out. To reduce ...

متن کامل

Guaranteed 3.67v bit encoding of planar triangle graphs

We present a new representation that is guaranteed to encode any planar triangle graph of V vertices in less than 3.67V bits. Our code improves on all prior solutions to this well studied problem and lies within 13% of the theoretical lower limit of the worst case guaranteed bound. It is based on a new encoding of the CLERS string produced by RossignacÕs Edgebreaker compression [Rossignac99]. T...

متن کامل

Edgebreaker: Compressing the incidence graph of triangle meshes

Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case and the expected compression ratios of previously reported schemes, most of which require O(nlogn) bits to store the incidence graph of a mesh of n triangles. Edgebreaker requires only 2n bits or less for si...

متن کامل

Improved Edge-Based Compression for the Connectivity of 3D Models

This study proposes an edge-based single-resolution compression scheme for triangular mesh connectivity. The proposed method improves upon EdgeBreaker. Nearly all of these algorithms are either multiple traversals or operate in reverse order. Operating in reverse order should work only off-line in the EdgeBreaker decompression process. Many restrictions on applications will be caused by these f...

متن کامل

Geometry Based Connectivity Compression of Triangular Meshes

Many interactive 3D graphics applications like manufacturing, design, networked-gaming, need to access 3D data remotely. Transfer of large data sets consumes lot of bandwidth and space. In this paper we describe a lossless scheme for compressing 3D-surface data, represented by triangular meshes. We present a new algorithm which exploits geometry (vertex) information for encoding connectivity. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • International Journal of Shape Modeling

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2002